Min, Max, and Sum
نویسندگان
چکیده
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss applications of our results to social choice. Journal of Economic Literature Classification Numbers: C0, D1, D6. © 2002 Elsevier Science (USA)
منابع مشابه
Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems
Given a graph G = (V,E) and k source-sink pairs {(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks to find k disjoint paths connecting all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks for k disjoint paths connecting all the sourcesink pairs with minimized length of the longest path. We show that the wei...
متن کاملOn the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
GivenagraphG = (V,E) andk source-sinkpairs{(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks k disjoint paths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also k disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the w...
متن کاملMax/min-sum distributed constraint optimization through value propagation on an alternating DAG
Distributed Constraint Optimization Problems (DCOPs) are NPhard and therefore the number of studies that consider incomplete algorithms for solving them is growing. Specifically, the Max-sum algorithm has drawn attention in recent years and has been applied to a number of realistic applications. Unfortunately, in many cases Max-sum does not produce high quality solutions. More specifically, whe...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملMAX-CSP, Graph Cuts and Statistical Physics
Baker’s technique, which was created over three decades ago, is a powerful tool for designing polynomial time approximation schemes (PTAS) for NP-hard optimization problems on planar graphs and their generalizations. In this paper, we propose a unified framework to formulate the optimization problems where the local constraints of these problems are encoded by functions attached on the vertices...
متن کاملMin-Max Problems on Factor-Graphs
We study the min-max problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both min-sum and sum-product inference, and focus on the later. This approach reduces the min-max inference problem to a sequence of constraint satisfaction problems (CSPs) which allows us to sample from a uniform distribution over the set of sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 106 شماره
صفحات -
تاریخ انتشار 2002